A Family of Model-Based Diagnosis Algorithms Based on Max-SAT
نویسندگان
چکیده
Max-SAT is an extensively studied optimization problem and variations of Max-SAT (like Partial Max-SAT and Weighted Max-SAT) can be used for computing minimal diagnoses. In this report we (1) describe a family of algorithms for computing minimal diagnoses based on Max-SAT and (2) experimentally evaluate the performance and optimality of these algorithms on a benchmark consisting of 74XXX/ISCAS85 combinational circuits. For the experiments we use both complete (partial and weighted) and SLS-based Max-SAT. We have established that the performance of complete Max-SAT and the optimality of SLS-based Max-SAT degrade when increasing the circuit size or the cardinality of the faults.
منابع مشابه
Approximation algorithms for MAX 4 - SATand rounding procedures for semide nite programs
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...
متن کاملThe Promise of Polynomial-based Local Search to Boost Boolean MAX-CSP Solvers
We propose a novel family of polynomial-based local search algorithms for MAX-CSP. From this family, we present an optimal, fast algorithm, called Evergreen local search (ELS). We evaluate ELS as a preprocessor for state-of-the-art MAX-CSP and MAX-SAT solvers which shows promising improvement in speed and quality.
متن کاملEvaluation of Serum Agglutination Test in the Diagnosis of Pediatric Brucellosis
Background & Aims: Brucellosis is a public health problem in many developing countries, including Iran. Diagnosis is based on history, clinical manifestations and positive serum agglutination test (SAT) or Wright test. The purpose of this study was to evaluate the diagnostic value of SAT in pediatric Brucellosis. Methods: In this prospective study, during 2 years, 52 patients with clinical feat...
متن کاملCombining a Unit Propagation with Genetic Algorithms to Solve max-SAT Problems
In this paper, we propose and investigate a new strategy for max-SAT problems. The proposed approach consists of a unit propagation strategy combined with a genetic algorithm. Based on the two strategies, we hope to propose an exact solver for max-SAT. The principal goal is to reduce the run-time of the unit propagation – based exact method. The latter is applied on partial assignments with few...
متن کاملLP problems constrained with D-FRIs
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...
متن کامل